Simultaneous approximation and interpolation with norm preservation
نویسندگان
چکیده
منابع مشابه
Global smoothness preservation and simultaneous approximation by multivariate discrete operators
In this article we study the multivariate generalized discrete singular operators defined on R , N ≥ 1, regarding their simultaneus global smoothness preservation property with respect to Lp norm for 1 ≤ p ≤ ∞, by using higher order moduli of smoothness. Furthermore, we study their simultaneous approximation properties. Mathematics Subject Classification (2010): 26A15, 26D15, 41A17, 41A25, 41A2...
متن کاملInterpolation, Preservation, and Pebble Games
Preservation and interpolation results are obtained for L1! and sublog-ics L L1! such that equivalence in L can be characterized by suitable back-and-forth conditions on sets of partial isomorphisms.
متن کاملMultilevel Interpolation and Approximation
Interpolation by translates of a given radial basis function (RBF) has become a well-recognized means of tting functions sampled at scattered sites in R d. A major drawback of these methods is their inability to interpolate very large data sets in a numerically stable way while maintaining a good t. To circumvent this problem, a multilevel interpolation (ML) method for scattered data was presen...
متن کاملDiscrepancy norm: Approximation and variations
This paper introduces an approach for the minimization of the discrepancy norm. The general idea is to replace the infinity norms appearing in the definition by L norms which are differentiable and to make use of this approximation for local optimization. We will show that the discrepancy norm can be approximated up to any ε and the robustness of this approximation is shown. Moreover, analytica...
متن کاملParsimonious Least Norm Approximation
A theoretically justiiable fast nite successive linear approximation algorithm is proposed for obtaining a parsimonious solution to a corrupted linear system Ax = b + p, where the corruption p is due to noise or error in measurement. The proposed linear-programming-based algorithm nds a solution x by parametrically minimizing the number of nonzero elements in x and the error k Ax ? b ? p k 1. N...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1971
ISSN: 0021-9045
DOI: 10.1016/0021-9045(71)90039-6